Autoregression , estimating functions , and optimality criteria

نویسنده

  • Wolfgang Wefelmeyer
چکیده

Abstract We consider d-order Markov chains satisfying a conditional constraint E(aθ(Xi−1, Xi) | Xi−1) = 0, where Xi−1 = (Xi−1, . . . , Xi−d). These comprise quasi-likelihood models and nonlinear and conditionally heteroscedastic autoregressive models with martingale innovations. Estimators for θ can be obtained from estimating equations ∑n i=1Wθ(Xi−1) aθ(Xi−1, Xi) = 0. We review different criteria for choosing good weights Wθ(Xi−1). They usually lead to weights that depend on unknown features of the transition distribution and must be estimated. We compare the approach via estimating functions with other ways of constructing estimators for θ, and discuss efficiency of the estimators in the sense of Hájek and LeCam. Analogous comparisons may be made for regression models.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...

متن کامل

Isogeometric Topology Optimization by Using Optimality Criteria and Implicit Function

A new method for structural topology optimization is introduced which employs the Isogeometric Analysis (IA) method. In this approach, an implicit function is constructed over the whole domain by Non-Uniform Rational B-Spline (NURBS) basis functions which are also used for creating the geometry and the surface of solution of the elasticity problem. Inspiration of the level set method zero level...

متن کامل

Parametric inference for discretely sampled stochastic differential equations

A review is given of parametric estimation methods for discretely sampled multivariate diffusion processes. The main focus is on estimating functions and asymptotic results. Maximum likelihood estimation is briefly considered, but the emphasis is on computationally less demanding martingale estimating functions. Particular attention is given to explicit estimating functions. Results on both fix...

متن کامل

Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions

In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...

متن کامل

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003